Bayesian Selection of Continuous-Time Markov Chain Evolutionary Models
نویسندگان
چکیده
منابع مشابه
Bayesian selection of continuous-time Markov chain evolutionary models.
We develop a reversible jump Markov chain Monte Carlo approach to estimating the posterior distribution of phylogenies based on aligned DNA/RNA sequences under several hierarchical evolutionary models. Using a proper, yet nontruncated and uninformative prior, we demonstrate the advantages of the Bayesian approach to hypothesis testing and estimation in phylogenetics by comparing different model...
متن کاملSimulation Algorithms for Continuous Time Markov Chain Models
Abstract Continuous time Markov chains are often used in the literature to model the dynamics of a system with low species count and uncertainty in transitions. In this paper, we investigate three particular algorithms that can be used to numerically simulate continuous time Markov chain models (a stochastic simulation algorithm, explicit and implicit tau-leaping algorithms). To compare these m...
متن کاملContinuous Time Markov Chain Models for Chemical Reaction Networks
A reaction network is a chemical system involving multiple reactions and chemical species. The simplest stochastic models of such networks treat the system as a continuous time Markov chain with the state being the number of molecules of each species and with reactions modeled as possible transitions of the chain. This chapter is devoted to the mathematical study of such stochastic models. We b...
متن کاملBayesian Variable Selection in Markov Mixture Models
Bayesian methods for variable selection have become increasingly popular in recent years, due to advances in MCMC computational algorithms. Several methods have been proposed in literature in the case of linear and generalized linear models. In this paper we adapt some of the most popular algorithms to a class of non-linear and non-Gaussian time series models, i.e. the Markov mixture models (MM...
متن کاملEfficient Continuous-Time Markov Chain Estimation
Many problems of practical interest rely on Continuous-time Markov chains (CTMCs) defined over combinatorial state spaces, rendering the computation of transition probabilities, and hence probabilistic inference, difficult or impossible with existing methods. For problems with countably infinite states, where classical methods such as matrix exponentiation are not applicable, the main alternati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Biology and Evolution
سال: 2001
ISSN: 1537-1719,0737-4038
DOI: 10.1093/oxfordjournals.molbev.a003872